Transforming a Single-Valued Transducer Into a Mealy Machine
نویسندگان
چکیده
منابع مشابه
A Mealy Machine of Growth
We consider a very simple Mealy machine (three states over a twosymbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sid...
متن کاملA Mealy Machine with Polynomial Growth of Irrational Degree
We consider a very simple Mealy machine (two non-trivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sided...
متن کاملPeriodic flexible maintenance planning in a single-machine production environment
Preventive maintenance is the essential part of many maintenance plans. From the production point of view, the flexibility of the maintenance intervals enhances the manufacturing efficiency. On the contrary, the maintenance departments tend to know the timing of the long term maintenance plans as certain as possible. In a single-machine production environment, this paper proposes a simulation–o...
متن کاملA Novel Stand-Alone Single-Phase Induction Generator Using a Three-Phase Machine and a Single-Phase PWM Inverter
A new type of single-phase stand-alone induction generator using a three-phase induction machine and a single-phase voltage-source PWM inverter is introduced. The generator scheme is capable of producing constant load frequency with a very well regulated output voltage. A small lead acid battery and a single-phase full diode-bridge rectifier are used to feed the inverter. The inverter feeds one...
متن کاملTransforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time. This result settles the complexity status of the problem under consideration which wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1998
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1517